#include<cstdio>//uncle-lu
#include<algorithm>
template<class T>void read(T &x)
{
	x=0;int f=0;char ch=getchar();
	while(ch<'0'||ch>'9') { f|=(ch=='-'); ch=getchar(); }
	while(ch<='9'&&ch>='0') { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); }
	x = f ? -x : x;
	return ;
}

struct node{
	int s, w;
	friend bool operator<(const node a, const node b)
	{
		return a.s < b.s;
	}
};
int n, r, q;
int line[200010];
int temp[200010];

int main()
{
	read(n);read(r);read(q);
	for (int i = 1; i <= n; i++) 
		read(line[i].s);
	for (int i = 1; i <= n; i++) 
		read(line[i].w);

	std::sort(line+1, line+1+n);


}
